A general scheme for token- and tree-based distributed mutual exclusion algorithms
نویسندگان
چکیده
منابع مشابه
Evaluation of Token Based Mutual Exclusion Algorithms In Distributed Systems
This paper presents a framework for token based mutual exclusion algorithms in distributed systems. Their exists some traditional token based mutual exclusion algorithm. Some new algorithms are proposed in order to increase fault tolerance, minimize message complexity and decrease synchronization delay. In this paper, some new approaches are used, like Token ring algorithm with centralized appr...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملReal-Time Token-Based Mutual Exclusion Algorithms
Many token-based, distributed mutual exclusion algorithms can be generalized by a single algorithm. The algorithm’s performance is dependent upon the logical topology imposed on the nodes and the policy used to forward requests. This paper extends the generalized algorithm to support prioritized, real-time requests in a generalized fashion and presents models that can be used to analyze the per...
متن کاملA Centralized Token-Based Algorithm for Distributed Mutual Exclusion
In this paper, we present a new algorithm for distributed mutual exclusion that combines the advantages of existing centralized and token-based algorithms: it takes only two messages to acquire the lock when it is not held by another process, and only one message to pass the lock from one process to another. At the same time, our algorithm generates signiicantly less message traac than non-cent...
متن کاملAn Eecient Token-based Algorithm for Distributed Mutual Exclusion
In this paper, we present an eecient token-based algorithm for distributed mutual exclusion. The algorithm uses a distributed queue, which is not necessarily FIFO, to enqueue the request messages of the nodes for entry into the critical section (CS). These request messages are timestamped using roughly synchronized clocks. On the average, the algorithm requires 2 to 3 number of messages per cri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1994
ISSN: 1045-9219
DOI: 10.1109/71.329670